Synthesizing Visual and Action Routines Using Constraint Programming
نویسندگان
چکیده
A diagrammatic problem-solver requires a library of visual routines (VRs) and action routines (ARs) the VRs are used to obtain information of specified types from the diagram and ARs to modify the diagram in specified ways. The VRs/ARs required are unbounded a new domain may call for new perceptions and actions. We report on progress on our research in building an automated VR/AR synthesis system that would take as input the definition of a new routine in terms of existing routines in the library and well-defined mathematical/logical constraints and synthesize the program for the desired routine using constraint programming. We illustrate the ideas by means of an example.
منابع مشابه
A Spatial Constraint Satisfaction Framework for Synthesizing Perceptions and Actions in Diagrammatic Reasoning
Diagrammatic reasoning is often modeled as a process in which subtasks may be solved, as appropriate, either by inference from symbolic representations or by information extracted by perception from a diagram, and additional subtasks may create or modify objects in the diagram. The required perceptions and actions are defined in terms of properties and relations to be satisfied by a set of diag...
متن کاملA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملThe Importance of Both Diagrammatic Conventions and Domain-Specific Knowledge for Diagram Literacy in Science: The Hierarchy as an Illustrative Case
Learning by producing diagrams p. 12 Eye fixations and diagrammatic reasoning p. 13 Cross-cultural user-experience design p. 16 Communicative signals as the key to automated understanding of simple bar charts p. 25 On line elaboration of a mental model during the understanding of an animation p. 40 From diagrams to models by analogical transfer p. 55 The mathematics of boundaries : a beginning ...
متن کاملComparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints
The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...
متن کاملBoundedness of KKT Multipliers in fractional programming problem using convexificators
‎In this paper, using the idea of convexificators, we study boundedness and nonemptiness of Lagrange multipliers satisfying the first order necessary conditions. We consider a class of nons- mooth fractional programming problems with equality, inequality constraints and an arbitrary set constraint. Within this context, define generalized Mangasarian-Fromovitz constraint qualification and sh...
متن کامل